A hybrid DEA-based K-means and invasive weed optimization for facility location problem

author

  • Farshad Faezy Razi Department of Industrial Management, Semnan Branch, Islamic Azad University, Semnan, Iran
Abstract:

In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhouette index. The efficiency of each cluster of stations was determined using the Charnes, Cooper and Rhodes input-oriented data envelopment analysis model. A bi-objective zero one programming model was used to select a Pareto optimal combination of rank and distance of stations. The Pareto solutions for the presented bi-objective model were determined using the invasive weed optimization method. Although the proposed methodology is meant for the selection of repair and maintenance stations in an oil refinery Company, it can be used in multi-criteria decision-making problems.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A fuzzy capacitated facility location-network design model: A hybrid firefly and invasive weed optimization (FIWO) solution

Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...

full text

A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

full text

A Hybrid Algorithm based on Invasive Weed Optimization and Particle Swarm Optimization for Global Optimization

In this paper, an effective combination of two Metaheuristic algorithms, namely Invasive Weed Optimization and the Particle Swarm Optimization, has been proposed. This hybridization called as HIWOPSO, consists of two main phases of Invasive Weed Optimization (IWO) and Particle Swarm Optimization (PSO). Invasive weed optimization is the natureinspired algorithm which is inspired by colonial beha...

full text

Improved Invasive Weed Optimization Based on Hybrid Genetic Algorithm

An improved Invasive weed optimization (IWO) based on hybrid genetic (HGIWO) is presented. In the new arithmetic, the inertial weight is adaptively adjusted to improve the convergence speed. The weeds are multiples by the selection and hybridization of genetic arithmetic. The import of hybrid genes improves excellent performance of weeds and reduces likelihood on getting into local optimization...

full text

GROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION

Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...

full text

A New Approximation Algorithm for the k-Facility Location Problem

The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + √ 3 + ǫ-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue 3

pages  -

publication date 2019-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023